Adjacent Vertex-Distinguishing Equitable V-Total Coloring (AVDEVTC) of a graph means on the basis of adjacent vertex-distinguishing V-total coloring, the differences between every two colors used in coloring are no more than one. The minimum number of colors used for completing AVDEVTC is called Adjacent Vertex-Distinguishing Equitable V-Total Chromatic Number (AVDEVTCN). A multi-objective optimization coloring algorithm was proposed to resolve the problem of AVDEVTC of the graph. A main objective function and four subobjective functions were designed according to the conditions of AVDEVTC. Every subobjective function was optimized to meet the requirements of the main objective function by the iterative exchange operation of the color set of every vertex on the coloring matrix, thus completed the coloring. Theoretical analysis and experimental comparison show that all of the simple connected graphs within eight vertices have the AVDEVTC, and their AVDEVTCN are between the maximum degree plus 1 and the maximum degree plus 2. The experimental result indicates that the proposed coloring algorithm can correctly calculate the AVDEVTCN of graphs within 1000 vertices in a short period of time.

Concerning the constrained resources and low detection rate of Android, a software behavior dynamic monitoring framework based on ROM was constructed by considering behavior characteristics of Android in installation mode, trigger mode and malicious load, and the effectivenesses of Support Vector Machine (SVM), decision tree, k-Nearest Neighbor (KNN) and Naive Bayesian (NB) classifier were evaluated using information gain, chi square test and Fisher Score. The results of evaluation on overall classification of the behavior log of 20916 malicious samples and 17086 normal samples show that SVM has the best performance in the detection of malicious software, its accuracy rate can reach 93%, and the False Positive Rate (FPR) is less than 2%. It can be applied to the online cloud analysis environment and detection platform, as well as meeting the needs of mass sample processing.

The research on the equitable total coloring is limited to some special graphs such as complete-graph and join-graph. For the normal equitable total coloring of the simple connected graph, there is not any feasible method in the published paper. In order to research the equitable total coloring of the normal graph, a new heuristic intelligent algorithm was proposed according to four constraint rules including vertex constraint rule, edge constraint rule, vertex-edge constraint rule and equitable constraint rule of the equitable total coloring. First, four sub-functions and one total function were ascertained. Second, by using the dyeing matrix and complementary matrix in each sub-function, the iterative exchange did not stop until each sub-function value was zero, that meant the subgoal-coloring was completed. If each sub-function value was 0, the total function value was 0, which meant coloring was successful. The experimental results show that the proposed algorithm can generate all of the simple connected graphs in which the number of vertices is no more than 8, and it can achieve the corresponding coloring, and then obtains the equitable total chromatic number. Also when any positive integer k is not less than 3 and not more than 9, random graph G has k-equitable total coloring. At the same time, the proposed algorithm chooses 72 graphs whose vertex number is between 20 and 400, and draws the diagram about the vertex number, edge number and color number according to the equitable total coloring results.